Effectively closed sets of measures and randomness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effectively closed sets of measures and randomness

We show that if a real x ∈ 2 is strongly Hausdorff Hh-random, where h is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. The proof uses a new method to construct measures, based on effective (partial) continuous transformations and a basis theorem for Π...

متن کامل

Effectively Closed Set of Measures and Randomness

We show that if a real x ∈ 2 is Hausdorff H-random, where h is an order function, then it is also random for a continuous probability measure μ such that the μ-measure of the basic open cylinders shrinks according to h. We use this result to derive a characterization of effective Hausdorff dimension similar to Frostman’s Theorem.

متن کامل

Jump inversions inside effectively closed sets and applications to randomness

We study inversions of the jump operator on Π1 classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random....

متن کامل

Effectively closed sets and enumerations

An effectively closed set, or Π 1 class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of Π 1 classes are shown to be mutually reducible via a compu...

متن کامل

Algorithmic Randomness of Closed Sets

We investigate notions of randomness in the space C[2N] of nonempty closed subsets of {0, 1}N. A probability measure is given and a version of the Martin-Löf test for randomness is defined. Π2 random closed sets exist but there are no random Π1 closed sets. It is shown that any random closed set is perfect, has measure 0, and has box dimension log2 4 3 . A random closed set has no n-c.e. elemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2008

ISSN: 0168-0072

DOI: 10.1016/j.apal.2008.06.015